Resolution and the integrality of satisfiability problems
نویسنده
چکیده
A satis ability problem can be regarded as a nondisjoint union of set covering problems We show that if the resolution method of theorem proving is applied to the satis ability problem its constraint set de nes an integral polytope if and only if the constraint sets of the set covering problems do In this sense resolution reduces the integrality question for the satis ability problem to that for the set covering problem
منابع مشابه
Resolution and the Integrality of Satis abilityProblems
A satissability problem can be regarded as a nondisjoint union of set covering problems. We show that if the resolution method of theorem proving is applied to the satissability problem, its constraint set deenes an integral polytope if and only if the constraint sets of the set covering problems do. In this sense, resolution reduces the integrality question for the satissability problem to tha...
متن کاملResolution procedures for multiple-valued optimization
Signed clausal forms offer a suitable logical framework for automated reasoning in multiple-valued logics. It turns out that the satisfiability problem of any finitely-valued propositional logic, as well as of certain infinitely-valued logics, can be easily reduced, in polynomial time, to the satisfiability problem of signed clausal forms. On the other hand, signed clausal forms are a powerful ...
متن کاملA Note on the Integrality Gap in the Nodal Interdiction Problem
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
متن کاملRank Bounds and Integrality Gaps for Cutting Planes Procedures
We present a new method for proving rank lower bounds for the cutting planes procedures of Gomory and Chvátal (GC) and Lovász and Schrijver (LS), when viewed as proof systems for unsatisfiability. We apply this method to obtain the following new results: First, we prove near-optimal rank bounds for GC and LS proofs for several prominent unsatisfiable CNF examples, including random kCNF formulas...
متن کاملA New Met
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches such as the Davis-Putnam procedure or resolution. We also show that GSAT can solve structured...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 74 شماره
صفحات -
تاریخ انتشار 1996